Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое abstract syntax tree - определение
TREE REPRESENTATION OF THE ABSTRACT SYNTACTIC STRUCTURE OF SOURCE CODE
Abstract syntax trees; Abstract Syntax Tree; Abstract syntax tree representation
![An abstract syntax tree for the following code for the [[Euclidean algorithm]]:<syntaxhighlight lang="python">
while b ≠ 0:
if a > b:
a := a - b
else:
b := b - a
return a
</syntaxhighlight>](https://commons.wikimedia.org/wiki/Special:FilePath/Abstract syntax tree for Euclidean algorithm.svg?width=200 "An abstract syntax tree for the following code for the [[Euclidean algorithm]]:<syntaxhighlight lang=\"python\">
while b ≠ 0:
if a > b:
a := a - b
else:
b := b - a
return a
</syntaxhighlight>")
Найдено результатов: 3103
abstract syntax tree
<compiler> (AST) A data structure representing something which
has been parsed, often used as a compiler or interpreter's
internal representation of a program while it is being
optimised and from which code generation is performed. The
range of all possible such structures is described by the
abstract syntax.
(1994-11-08)
Abstract syntax tree
In computer science, an abstract syntax tree (AST), or just syntax tree, is a tree representation of the abstract syntactic structure of text (often source code) written in a formal language. Each node of the tree denotes a construct occurring in the text.
Abstract syntax
SYNTACTIC STRUCTURE INDEPENDENT OF ANY PARTICULAR REPRESENTATION OR ENCODING
Abstract Syntax; First-order abstract syntax
In computer science, the abstract syntax of data is its structure described as a data type (possibly, but not necessarily, an abstract data type), independent of any particular representation or encoding. This is particularly used in the representation of text in computer languages, which are generally stored in a tree structure as an abstract syntax tree.
abstract syntax
SYNTACTIC STRUCTURE INDEPENDENT OF ANY PARTICULAR REPRESENTATION OR ENCODING
Abstract Syntax; First-order abstract syntax
<language, data> A representation of data (typically either a
message passing over a communications link or a program being
compiled) which is independent of machine-oriented structures
and encodings and also of the physical representation of the
data (called "concrete syntax" in the case of compilation or
"transfer syntax" in communications).
A compiler's internal representation of a program will
typically be specified by an abstract syntax in terms of
categories such as "statement", "expression" and "identifier".
This is independent of the source syntax (concrete syntax)
of the language being compiled (though it will often be very
similar). A parse tree is similar to an abstract syntax
tree but it will typically also contain features such as
parentheses which are syntactically significant but which are
implicit in the structure of the abstract syntax tree.
(1998-05-26)
syntax tree
WIKIMEDIA DISAMBIGUATION PAGE
Syntactic tree; Syntax tree (disambiguation)
<mathematics, theory, language> A tree representing the
abstract syntax of some tokens in a language.
(1998-11-12)
Higher-order abstract syntax
TECHNIQUE FOR THE REPRESENTATION OF ABSTRACT SYNTAX TREES IN LANGUAGES WITH VARIABLE BINDERS
Higher order abstract syntax
In computer science, higher-order abstract syntax (abbreviated HOAS) is a technique for the representation of abstract syntax trees for languages with variable binders.
Abstract machine
![A run of a [[Turing machine]].](https://commons.wikimedia.org/wiki/Special:FilePath/2-state 3-symbol Turing Machine.png?width=200 "A run of a [[Turing machine]].")
![Pictorial representation of a [[Krivine machine]].](https://commons.wikimedia.org/wiki/Special:FilePath/Machine de Krivine.jpg?width=200 "Pictorial representation of a [[Krivine machine]].")
THEORETICAL MODEL OF A COMPUTER HARDWARE OR SOFTWARE SYSTEM USED IN AUTOMATA THEORY
Abstract computer; Abstract Machine
An abstract machine is a computer science theoretical model that allows for a detailed and precise analysis of how a computer system functions. It is analogous to a mathematical function in that it receives inputs and produces outputs based on predefined rules. Abstract machines vary from literal machines in that they are expected to perform correctly and independently of hardware. Abstract machines are “machines” because they allow step-by-step execution of programmes; they are “abstract” because they ignore many aspects of actual (hardware) machines. A typical abstract machine consists of a definition in terms of input, output, and the set of allowable operations used to turn the former into the latter. They can be used for purely theoretical reasons as well as models for real-world computer systems. In the theory of computation, abstract machines are often used in thought experiments regarding computability or to analyse the complexity of algorithms. This use of abstract machines is connected to th
abstract machine
THEORETICAL MODEL OF A COMPUTER HARDWARE OR SOFTWARE SYSTEM USED IN AUTOMATA THEORY
Abstract computer; Abstract Machine
1. <language> A processor design which is not intended to be
implemented as hardware, but which is the notional executor
of a particular intermediate language (abstract machine
language) used in a compiler or interpreter. An abstract
machine has an instruction set, a register set and a model
of memory. It may provide instructions which are closer to
the language being compiled than any physical computer or it
may be used to make the language implementation easier to
port to other platforms.
A virtual machine is an abstract machine for which an
interpreter exists.
Examples: ABC, Abstract Machine Notation, ALF, CAML,
F-code, FP/M, Hermes, LOWL,
Christmas, SDL, S-K reduction machine, SECD, Tbl,
Tcode, TL0, WAM.
2. <theory> A procedure for executing a set of instructions in
some formal language, possibly also taking in input data and
producing output. Such abstract machines are not intended to
be constructed as hardware but are used in thought
experiments about computability.
Examples: Finite State Machine, Turing Machine.
(1995-03-13)
Abstract type
FEATURE OF A PROGRAMMING LANGUAGE
Abstract class; Pure virtual class
In programming languages, an abstract type is a type in a nominative type system that cannot be instantiated directly; a type that is not abstract – which can be instantiated – is called a concrete type. Every instance of an abstract type is an instance of some concrete subtype.
Parse tree
ORDERED, ROOTED TREE THAT REPRESENTS THE SYNTACTIC STRUCTURE OF A STRING ACCORDING TO SOME CONTEXT-FREE GRAMMAR
Terminal and nonterminal functions; Terminal function; Parse graph; Concrete syntax; Syntactic tree diagram; Concrete syntax tree; Parsing tree; Non-terminal function; Terminal and non terminal functions; Derivation tree; Phrase marker; P-marker; P marker; Concrete Syntax Tree; Constituency-based parse tree; Dependency-based parse tree; Terminal and non-terminal functions
A parse tree or parsing treeSee Chiswell and Hodges 2007: 34. or derivation tree or concrete syntax tree is an ordered, rooted tree that represents the syntactic structure of a string according to some context-free grammar.
Википедия
Abstract syntax tree
In computer science, an abstract syntax tree (AST), or just syntax tree, is a tree representation of the abstract syntactic structure of text (often source code) written in a formal language. Each node of the tree denotes a construct occurring in the text.
The syntax is "abstract" in the sense that it does not represent every detail appearing in the real syntax, but rather just the structural or content-related details. For instance, grouping parentheses are implicit in the tree structure, so these do not have to be represented as separate nodes. Likewise, a syntactic construct like an if-condition-then statement may be denoted by means of a single node with three branches.
This distinguishes abstract syntax trees from concrete syntax trees, traditionally designated parse trees. Parse trees are typically built by a parser during the source code translation and compiling process. Once built, additional information is added to the AST by means of subsequent processing, e.g., contextual analysis.
Abstract syntax trees are also used in program analysis and program transformation systems.
